Optimal makespan scheduling with given bounds of processing times
نویسندگان
چکیده
منابع مشابه
Scheduling with Discretely Compressible Processing Times to Minimize Makespan
In the classical scheduling problems, it is always assumed that the processing time of a job is fixed. In this paper, we address the scheduling with discretely compressible processing times, i.e., the possible processing time of a job can only have finitely many possibilities. Of course, choosing to process any job with a compressed processing time incurs a compression cost. We consider the sin...
متن کاملMinimum Makespan Scheduling with Low Rank Processing Times
We investigate approximation algorithms for the classical minimum makespan scheduling problem, focusing on instances where the rank of the matrix describing the processing times of the jobs is bounded. A bounded rank matrix arises naturally when the processing time of a job on machine depends upon a bounded set of resources. A bounded rank matrix also shows up when jobs have varying degrees of ...
متن کاملMean flow time minimization with given bounds of processing times
We consider a job shop scheduling problem under uncertain processing times and fixed precedence and capacity constraints. Each of the random processing times can take any real value between given lower and upper bounds. The goal is to find a set of schedules which contains at least one optimal schedule (with mean flow time criterion) for any admissible realization of the random processing times...
متن کاملMakespan minimization in single-machine scheduling with step-deterioration of processing times
This paper considers a single-machine scheduling problem of minimizing the maximum completion time for a set of independent jobs. The processing time of a job is a non-linear step function of its starting time and due date. The problem is already known to be NP-hard in the literature. In this paper, we first show this problem to be NP-hard in the ordinary sense by proposing a pseudo-polynomial ...
متن کاملParallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
This paper addresses parallel machine scheduling with learning effects. The objective is to minimize the makespan. To satisfy reality, we consider the processing times as fuzzy numbers. To the best of our knowledge, scheduling with learning effects and fuzzy processing times on parallel machines has never been studied. The possibility measure will be used to rank the fuzzy numbers. Two heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1997
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(97)00132-5